Gaussian quadrature for sums: A rapidly convergent summation scheme
نویسندگان
چکیده
منابع مشابه
Gaussian quadrature for sums: A rapidly convergent summation scheme
Gaussian quadrature is a well-known technique for numerical integration. Recently Gaussian quadrature with respect to discrete measures corresponding to finite sums has found some new interest. In this paper we apply these ideas to infinite sums in general and give an explicit construction for the weights and abscissae of Gaussian formulas. The abscissae of the Gaussian summation have a very in...
متن کاملA Rapidly Convergent Descent Method for Minimization
27 information is used. A choice then has to be made as to which is the most eecient option. Acknowledgments. We are grateful to the referees for their useful comments. We thank Robert Michael Lewis for his valuable suggestions on how best to present this material, particularly the results given in x7. Mathematical models for the predictive value of early CA125 serum levels in epithelial ovaria...
متن کاملA rapidly convergent descent method for minimization
We are concerned in this paper with the general problem of finding an unrestricted local minimum of a function J[xu x2 • • •, xn) of several variables xx, x2, • •., xn. We suppose that the function of interest can be calculated at all points. It is convenient to group functions into two main classes according to whether the gradient vector g, = Wbx, is defined analytically at each point or must...
متن کاملA Very Rapidly Convergent Product Expansion For
There has recently been considerable interest in an essentially quadratic method for computing n. The algorithm, first suggested by Salamin [6], is based upon an identity known to Gauss [-3, p. 377], [4]. This iteration has been used by two Japanese researchers, Y. Tamura and Y. Kanada, to compute 223 decimal digits of n in under 7 hours. They have now successfully computed 224 digits (more tha...
متن کاملExponentially convergent lattice sums.
For any oblique incidence and arbitrarily high order, lattice sums for one-dimensional gratings can be expressed in terms of exponentially convergent series. The scattering Green's function can be efficiently evaluated also in the grating plane. Numerical implementation of the method is 200 times faster than for the previous best result.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2009
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-09-02289-3